Probability Generating Functions for Discrete Real Valued Random Variables

نویسندگان

  • MANUEL L. ESQUÍVEL
  • José de Sam Lazaro
چکیده

The probability generating function is a powerful technique for studying the law of finite sums of independent discrete random variables taking integer positive values. For real valued discrete random variables, the well known elementary theory of Dirichlet series and the symbolic computation packages available nowadays, such as Mathematica 5 TM, allows us to extend to general discrete random variables this technique. Being so, the purpose of this work is twofold. Firstly we show that discrete random variables taking real values, non necessarily integer or rational, may be studied with probability generating functions. Secondly we intend to draw attention to some practical ways of performing the necessary calculations. 1. Classical probability generating functions Generating functions are an useful and up to date tool in nowadays practical mathematics, in particular in discrete mathematics and combinatorics (see [Lando 03]) and, in the case of probability generating functions, in distributional convergence results as in [Kallenberg 02][p. 84]. Its uses in basic probability are demonstrated in the classic reference [Feller 68][p. 266]. More recently, probability generating functions for integer valued random variables have been studied intensively mainly with some applied purposes in mind. See, for instance [Dowling et al 97], [Marques et al 89], [Nakamura et al 93], [Nakamura et al 93a], [Nakamura et al 93b], [Rémillard et al 00], [Rueda et al 91] and [Rueda et al 99]. The natural extension of the definition of probability generating function to non negative real valued random variable X, as the expectation of the function tX , is very clearly presented in the treatise [Hoffmann-Jørgensen 94][p. 288] where some of the consequences, drawn directly from this definition, are stated. Let us briefly formulate some classical results on probability generating functions for integer valued random variables recalling the useful connection between the topics of probability generating functions and of analytic function theory. Let X be a random variable taking values in Z and consider that for all k ∈ Z we have pk := P[X = k] ∈ [0, 1]. Date: July 19, 2004. 1991 Mathematics Subject Classification. 60–08, 60E10, 30B50.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Variables and Their Distributions

Contents 1. Introduction. 2. The distribution function of a random variable. 3. Classification of random variables. 4. Some special discrete probability distributions. 5. Some special continuous probability distributions. 6. Location characteristics of a real-valued random variable. 7. Dispersion characteristics of a real-valued random variable. 8. Joint distribution functions. 9. Independence ...

متن کامل

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...

متن کامل

Probability Measure on Discrete Spaces and Algebra of Real-Valued Random Variables

In this article we continue formalizing probability and randomness started in [13], where we formalized some theorems concerning the probability and real-valued random variables. In this paper we formalize the variance of a random variable and prove Chebyshev’s inequality. Next we formalize the product probability measure on the Cartesian product of discrete spaces. In the final part of this ar...

متن کامل

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

Uniformly Generating Distribution Functions for Discrete Random Variables

An algorithm is presented which, with optimal efficiency, solves the problem of uniform random generation of distribution functions for an n-valued random variable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004